Stochastic portfolio optimization with proportional transaction costs: Convex reformulations and computational experiments
نویسندگان
چکیده
We propose a probabilistic version of the Markowitz portfolio problem with proportional transaction costs. We derive equivalent convex reformulations, and analyze their computational efficiency for solving large (up to 2000 securities) portfolio problems. There is a great disparity in the solution times. The time differential between formulations can reach several orders of magnitude for the largest instances. The second-order cone formulation in which the number of quadratic terms is invariant to the number of assets is the most efficient.
منابع مشابه
Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
The inclusion of transaction costs is an essential element of any realistic portfolio optimization. In this paper, we consider an extension of the standard portfolio problem in which convex transaction costs are incurred to rebalance an investment portfolio. In particular, we consider linear, piecewise linear, and quadratic transaction costs. The Markowitz framework of mean-variance efficiency ...
متن کاملRebalancing an Investment Portfolio in the Presence of Convex Transaction Costs and Market Impact Costs
The inclusion of transaction costs is an essential element of any realistic portfolio optimization. In this paper, we extend the standard portfolio problem to consider convex transaction costs that are incurred to rebalance an investment portfolio. Market impact costs measure the effect on the price of a security that result from an effort to buy or sell the security, and they can constitute a ...
متن کاملPortfolio optimization with linear and fixed transaction costs
We consider the problem of portfolio selection, with transaction costs and constraints on exposure to risk. Linear transaction costs, bounds on the variance of the return, and bounds on different shortfall probabilities are efficiently handled by convex optimization methods. For such problems, the globally optimal portfolio can be computed very rapidly. Portfolio optimization problems with tran...
متن کاملDC Programming and DCA for Portfolio Optimization with Linear and Fixed Transaction Costs
We consider the problem of portfolio selection, with transaction costs and constraints on exposure to risk. Linear transaction costs, bounds on the variance of the return, and bounds on different shortfall probabilities are efficiently handled by convex optimization methods. Problems with transaction costs that include a fixed fee, or discount breakpoints, cannot be directly solved by convex op...
متن کاملAn Affine Control Method for Optimal Dynamic Asset Allocation with Transaction Costs
In this paper, we present a novel and computationally efficient approach to constrained discrete-time dynamic asset allocation over multiple periods. This technique is able to control portfolio expectation and variance at both final and intermediate stages of the decision horizon and may account for proportional transaction costs and intertemporal dependence of the return process. A key feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012